Matroid Complexity and Nonsuccinct Descriptions
نویسنده
چکیده
We investigate an approach to matroid complexity that involves describing a matroid via a list of independent sets, bases, circuits, or some other family of subsets of the ground set. The computational complexity of algorithmic problems under this scheme appears to be highly dependent on the choice of input type. We define an order on the various methods of description, and we show how this order acts upon 10 types of input. We also show that under this approach several natural algorithmic problems are complete in classes thought not to be
منابع مشابه
The Optimal Path - Matching
We describe a common generalization of the weighted matching problem and the weighted matroid intersection problem. In this context we establish common generalizations of the main results on those two problems--polynomial-time solvability, rain-max theorems, and totally dual integral polyhedral descriptions. New applications of these results include a strongly polynomial separation algorithm fo...
متن کاملBicircular matroids representable over GF(4) or GF(5)
Given a bicircular matroid B(G) and q ∈ {4, 5}, we characterize when the bicircular matroid B(G) is GF (q)-representable by precisely describing the structure of G. These descriptions yield polynomial-time algorithms with input G to certify if B(G) is or is not GF (q)-representable.
متن کاملThe Optimal Path-Matching Problem
We describe a common generalization of the weighted matching problem and the weighted matroid intersection problem. In this context we establish common generalizations of the main results on those two problems|polynomial-time solvability, min-max theorems, and totally dual integral polyhedral descriptions. New applications of these results include a strongly polynomial separation algorithm for ...
متن کاملParallel Complexity for Matroid Intersection and Matroid Parity Problems
Let two linear matroids have the same rank in matroid intersection. A maximum linear matroid intersection (maximum linear matroid parity set) is called a basic matroid intersection (basic matroid parity set), if its size is the rank of the matroid. We present that enumerating all basic matroid intersections (basic matroid parity sets) is in NC, provided that there are polynomial bounded basic m...
متن کاملThe Complexity of Succinct Elections
The computational study of elections generally assumes that the preferences of the electorate come in as a list of votes. Depending on the context, it may be much more natural to represent the list succinctly, as the distinct votes of the electorate and their counts. We consider how this succinct representation of the voters affects the computational complexity of election problems. Though the ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- SIAM J. Discrete Math.
دوره 22 شماره
صفحات -
تاریخ انتشار 2008